Applying the Steepest Descent Method with BINSYN on RY Per Photometry
نویسندگان
چکیده
منابع مشابه
On the Steepest Descent Method for Matrix
We consider the special case of the restarted Arnoldi method for approximating the product of a function of a Hermitian matrix with a vector which results when the restart length is set to one. When applied to the solution of a linear system of equations, this approach coincides with the method of steepest descent. We show that the method is equivalent with an interpolation process in which the...
متن کاملOn the Steepest Descent Method for Matrix
We consider the special case of the restarted Arnoldi method for approximating the product of a function of a Hermitian matrix with a vector which results when the restart length is set to one. When applied to the solution of a linear system of equations, this approach coincides with the method of steepest descent. We show that the method is equivalent with an interpolation process in which the...
متن کاملSteepest descent method on a Riemannian manifold: the convex case
In this paper we are interested in the asymptotic behavior of the trajectories of the famous steepest descent evolution equation on Riemannian manifolds. It writes ẋ (t) + gradφ (x (t)) = 0. It is shown how the convexity of the objective function φ helps in establishing the convergence as time goes to infinity of the trajectories towards points that minimize φ. Some numerical illustrations are ...
متن کاملComputing diffraction integrals with the numerical method of steepest descent
A common type of integral to solve numerically in computational room acoustics and other applications is the diffraction integral. Various formulations are encountered but they are usually of the Fourier-type, which means an oscillating integrand which becomes increasingly expensive to compute for increasing frequencies. Classical asympotic solution methods, such as the stationary-phase method,...
متن کاملA limited memory steepest descent method
The possibilities inherent in steepest descent methods have been considerably amplified by the introduction of the Barzilai-Borwein choice of step-size, and other related ideas. These methods have proved to be competitive with conjugate gradient methods for the minimization of large dimension unconstrained minimization problems. This paper suggests a method which is able to take advantage of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the International Astronomical Union
سال: 2011
ISSN: 1743-9213,1743-9221
DOI: 10.1017/s1743921311027724